当前，大型预训练模型被广泛应用于神经代码完成系统，例如GitHub Copilot，AixCoder和Tabnine。尽管大型模型的表现大大优于较小的同行，但与2,631名参与者的调查显示，开发人员未接受大约70 \％的copilot的代码完成。被审查但不接受，这些完成对生产力构成了威胁。此外，考虑到大型模型的高成本，它是计算资源和能源的巨大浪费，这严重违背了AI技术的可持续发展原则。此外，在代码完成系统中，完成请求会自动并积极地发给模型，因为开发人员类型输出，这大大加剧了工作负载。但是，据我们所知，在神经法规完成的背景下，从未实现过这种废物，更不用说有效地解决了。因此，迫切需要防止以成本友好的方式进行这种无利可图的代码完成。为了填补这一空白，我们首先研究这些完成的提示，并找到四个可观察到的及时模式，这些模式证明了根据提示本身识别此类提示的可行性。在这一发现的激励下，我们提出了一种早期的拒绝机制，以预言完成质量而不将其发送给LCM，以拒绝低返回的提示。此外，我们提出了一个基于轻量变压器的估计器，以证明该机制的可行性。实验结果表明，估算器以83.2％的有希望的准确性拒绝低退还提示。

Stochastic human motion prediction aims to forecast multiple plausible future motions given a single pose sequence from the past. Most previous works focus on designing elaborate losses to improve the accuracy, while the diversity is typically characterized by randomly sampling a set of latent variables from the latent prior, which is then decoded into possible motions. This joint training of sampling and decoding, however, suffers from posterior collapse as the learned latent variables tend to be ignored by a strong decoder, leading to limited diversity. Alternatively, inspired by the diffusion process in nonequilibrium thermodynamics, we propose MotionDiff, a diffusion probabilistic model to treat the kinematics of human joints as heated particles, which will diffuse from original states to a noise distribution. This process offers a natural way to obtain the "whitened" latents without any trainable parameters, and human motion prediction can be regarded as the reverse diffusion process that converts the noise distribution into realistic future motions conditioned on the observed sequence. Specifically, MotionDiff consists of two parts: a spatial-temporal transformer-based diffusion network to generate diverse yet plausible motions, and a graph convolutional network to further refine the outputs. Experimental results on two datasets demonstrate that our model yields the competitive performance in terms of both accuracy and diversity.

对话推荐系统（CRS）的注意力日益增长，该系统可作为基于对话和建议的以任务为基础的工具，以提供感兴趣的项目并探索用户偏好。但是，CRS中现有的工作未能向用户明确显示推理逻辑，并且整个CRS仍然是黑匣子。因此，我们提出了一个基于生成对话代理的解释，以解释他们为何采取行动的解释，提出了一个名为“解释建议”（EGCR）的新颖端到端框架。 EGCR结合了用户评论，以增强项目表示并提高整个对话的信息。据我们所知，这是对现实世界数据集上可解释的对话建议的第一个框架。此外，我们在一个基准的对话推荐数据集上评估了EGCR，并比其他最先进的模型在建议准确性和对话质量上获得更好的性能。最后，广泛的实验表明，生成的解释不仅具有高质量和解释性，而且使CRS更加值得信赖。我们将使我们的代码可为CRS社区做出贡献

先前关于人类运动预测的工作遵循观察到的序列与要预测的序列之间建立映射关系的模式。但是，由于多元时间序列数据的固有复杂性，找到运动序列之间的外推关系仍然是一个挑战。在本文中，我们提出了一种新的预测模式，该模式介绍了以前被忽视的人类姿势，以从插值的角度实施预测任务。这些姿势在预测序列后存在，并形成特权序列。要具体而言，我们首先提出了一个插值学习网络（ITP-NETWORK），该网络既编码观察到的序列和特权序列，以插入预测的序列之间，其中嵌入式的特权序列 - 编码器（Priv-incoder）学习了这些序列特权知识（PK）同时。然后，我们提出了一个最终的预测网络（FP-NETWORK），该网络无法观察到特权序列，但配备了一种新型的PK模拟器，该序列可以提取从先前的网络中学到的PK。该模拟器作为输入观察到的序列，但近似私有编码器的行为，从而使fp-network模仿插值过程。广泛的实验结果表明，在短期和长期预测中，我们的预测模式在基准的H.36M，CMU-MOCAP和3DPW数据集上实现了最先进的性能。

由于大多数入院的患者生存，因此感兴趣的医疗事件（例如死亡率）通常以较低的速度发生。具有这种不平衡率（类密度差异）的训练模型可能会导致次优预测。传统上，这个问题是通过临时方法（例如重新采样或重新加权）来解决的，但在许多情况下的性能仍然有限。我们为此不平衡问题提出了一个培训模型的框架：1）我们首先将特征提取和分类过程分离，分别调整每个组件的训练批次，以减轻由类密度差异引起的偏差；2）我们既有密度感知的损失，又是错误分类的可学习成本矩阵。我们证明了模型在现实世界医学数据集（TOPCAT和MIMIC-III）中的改进性能，以显示与域中的基线相比，AUC-ROC，AUC-PRC，BRIER技能得分的改进。

The need for efficient computational screening of molecular candidates that possess desired properties frequently arises in various scientific and engineering problems, including drug discovery and materials design. However, the large size of the search space containing the candidates and the substantial computational cost of high-fidelity property prediction models makes screening practically challenging. In this work, we propose a general framework for constructing and optimizing a virtual screening (HTVS) pipeline that consists of multi-fidelity models. The central idea is to optimally allocate the computational resources to models with varying costs and accuracy to optimize the return-on-computational-investment (ROCI). Based on both simulated as well as real data, we demonstrate that the proposed optimal HTVS framework can significantly accelerate screening virtually without any degradation in terms of accuracy. Furthermore, it enables an adaptive operational strategy for HTVS, where one can trade accuracy for efficiency.

Learning the underlying distribution of molecular graphs and generating high-fidelity samples is a fundamental research problem in drug discovery and material science. However, accurately modeling distribution and rapidly generating novel molecular graphs remain crucial and challenging goals. To accomplish these goals, we propose a novel Conditional Diffusion model based on discrete Graph Structures (CDGS) for molecular graph generation. Specifically, we construct a forward graph diffusion process on both graph structures and inherent features through stochastic differential equations (SDE) and derive discrete graph structures as the condition for reverse generative processes. We present a specialized hybrid graph noise prediction model that extracts the global context and the local node-edge dependency from intermediate graph states. We further utilize ordinary differential equation (ODE) solvers for efficient graph sampling, based on the semi-linear structure of the probability flow ODE. Experiments on diverse datasets validate the effectiveness of our framework. Particularly, the proposed method still generates high-quality molecular graphs in a limited number of steps.

High-utility sequential pattern mining (HUSPM) has emerged as an important topic due to its wide application and considerable popularity. However, due to the combinatorial explosion of the search space when the HUSPM problem encounters a low utility threshold or large-scale data, it may be time-consuming and memory-costly to address the HUSPM problem. Several algorithms have been proposed for addressing this problem, but they still cost a lot in terms of running time and memory usage. In this paper, to further solve this problem efficiently, we design a compact structure called sequence projection (seqPro) and propose an efficient algorithm, namely discovering high-utility sequential patterns with the seqPro structure (HUSP-SP). HUSP-SP utilizes the compact seq-array to store the necessary information in a sequence database. The seqPro structure is designed to efficiently calculate candidate patterns' utilities and upper bound values. Furthermore, a new upper bound on utility, namely tighter reduced sequence utility (TRSU) and two pruning strategies in search space, are utilized to improve the mining performance of HUSP-SP. Experimental results on both synthetic and real-life datasets show that HUSP-SP can significantly outperform the state-of-the-art algorithms in terms of running time, memory usage, search space pruning efficiency, and scalability.

Graph Neural Networks (GNNs) have become increasingly important in recent years due to their state-of-the-art performance on many important downstream applications. Existing GNNs have mostly focused on learning a single node representation, despite that a node often exhibits polysemous behavior in different contexts. In this work, we develop a persona-based graph neural network framework called PersonaSAGE that learns multiple persona-based embeddings for each node in the graph. Such disentangled representations are more interpretable and useful than a single embedding. Furthermore, PersonaSAGE learns the appropriate set of persona embeddings for each node in the graph, and every node can have a different number of assigned persona embeddings. The framework is flexible enough and the general design helps in the wide applicability of the learned embeddings to suit the domain. We utilize publicly available benchmark datasets to evaluate our approach and against a variety of baselines. The experiments demonstrate the effectiveness of PersonaSAGE for a variety of important tasks including link prediction where we achieve an average gain of 15% while remaining competitive for node classification. Finally, we also demonstrate the utility of PersonaSAGE with a case study for personalized recommendation of different entity types in a data management platform.

With the development of natural language processing techniques(NLP), automatic diagnosis of eye diseases using ophthalmology electronic medical records (OEMR) has become possible. It aims to evaluate the condition of both eyes of a patient respectively, and we formulate it as a particular multi-label classification task in this paper. Although there are a few related studies in other diseases, automatic diagnosis of eye diseases exhibits unique characteristics. First, descriptions of both eyes are mixed up in OEMR documents, with both free text and templated asymptomatic descriptions, resulting in sparsity and clutter of information. Second, OEMR documents contain multiple parts of descriptions and have long document lengths. Third, it is critical to provide explainability to the disease diagnosis model. To overcome those challenges, we present an effective automatic eye disease diagnosis framework, NEEDED. In this framework, a preprocessing module is integrated to improve the density and quality of information. Then, we design a hierarchical transformer structure for learning the contextualized representations of each sentence in the OEMR document. For the diagnosis part, we propose an attention-based predictor that enables traceable diagnosis by obtaining disease-specific information. Experiments on the real dataset and comparison with several baseline models show the advantage and explainability of our framework.